Bisimulation Equivalence is Decidable for all Context-Free Processes
نویسندگان
چکیده
منابع مشابه
Decidability of Bisimulation Equivalence of Context-free Processes Extends to Processes Deened over Bpa
In CHS92] was proved that (strong) bisimulation equivalence is de-cidable for all context-free processes. We reduce eeectively the question of bisimulation equivalence of processes in BPA to that of context-free processes, by interpreting the deadlocking process as a process which iterates a fresh action forever. This shows that bisimulation is also decidable for BPA. 1 Introduction In BBK87, B...
متن کاملA Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes
A polynomial-time procedure is presented for deciding bisimilarity of normed context-free processes. It follows as a corollary that language equivalence of simple context-free grammars is decidable in polynomial time.
متن کاملFast equivalence-checking for normed context-free processes
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5), thus improving the previously known complexity O(n8polylog(n)). It also improves the previously known complexity O(n6polylog(n)) of the equality problem for simple grammars. Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.1
متن کاملOn the Complexity of Deciding Behavioural Equivalences and Preorders A Survey
This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinite-state BPA [BK84b] processes. A distinction, which turns out to be important in the finite-state processes, is that of simulation-like eq...
متن کاملProcess Algebra, CCS, and Bisimulation Decidability
Over the past fifteen years, there has been intensive study of formal systems that can model concurrency and communication. Two such systems are the Calculus of Communicating Systems, and the Algebra of Communicating Processes. The objective of this paper has two aspects; (1) to study the characteristics and features of these two systems, and (2) to investigate two interesting formal proofs con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 121 شماره
صفحات -
تاریخ انتشار 1992